Congestion Avoidance in Computer Networks with a Connectionless Network Layer

نویسندگان

  • Raj Jain
  • K. Ramakrishnan
  • Dah-Ming Chiu
چکیده

Widespread use of computer networks and the use of varied technology for the interconnection of computers has made congestion a signi cant problem. In this report, we summarize our research on congestion avoidance. We compare the concept of congestion avoidance with that of congestion control. Brie y, congestion control is a recovery mechanism, while congestion avoidance is a prevention mechanism. A congestion control scheme helps the network to recover from the congestion state while a congestion avoidance scheme allows a network to operate in the region of low delay and high throughput with minimal queuing, thereby preventing it from entering the congested state in which packets are lost due to bu er shortage. A number of possible alternatives for congestion avoidance were identi ed. From these alternatives we selected one called the binary feedback scheme in which the network uses a single bit in the network layer header to feed back the congestion information to its users, which then increase or decrease their load to make optimal use of the resources. The concept of global optimality in a distributed system is de ned in terms of e ciency and fairness such that they can be independently quanti ed and apply to any number of resources and users. The proposed scheme has been simulated and shown to be globally e cient, fair, responsive, convergent, robust, distributed, and con guration-independent.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Improvement of the mechanism of congestion avoidance in mobile networks

Mobile ad hoc network congestion control is a significant problem. Standard mechanism for congestion control (TCP), the ability to run certain features of a wireless network, several mutations are not common. In particular, the enormous changes in the network topology and the joint nature of the wireless network. It also creates significant challenges in mobile ad hoc networks (MANET), density ...

متن کامل

Congestion Avoidance in Computer Networks with a Connectionless Network Layer, Part I: Concepts, Goals and Methodology

Congestion is said to occur in the network when the resource demands exceed the capacity and packets are lost due to too much queuing in the network. During congestion, the network throughput may drop to zero and the path delay may become very high. A congestion control scheme helps the network to recover from the congestion state. A congestion avoidance scheme allows a network to operate in th...

متن کامل

A Binary Feedback Scheme for Congestion Avoidance in Computer Networks with Connectionless Network Layer

We propose a scheme for congestion avoidance in networks using a connectionless protocol at the network layer. The scheme uses feedback from the network to the users of the network. The interesting challenge for the scheme is to use a minimal amount of feedback (one bit in each packet) from the network to adjust the amount of traffic allowed into the network. The servers in the network detect c...

متن کامل

Applying Fuzzy Sliding Mode Control Based on Genetic Algorithms to Congestion Avoidance in Computer Network

of Fuzzy Sliding Mode Control (FSMC) based on Genetic Algorithms (GAs) roposed control strategy, a robust controller is designed for Active Queue n computer networks. AQM takes a trade-off between link utilization and ata packets. From control point of view, it is rational to regard AQM as a m. We design a fuzzy sliding mode controller for the AQM system as an nd apply the optimal searching alg...

متن کامل

Creating Dynamic Sub-Route to Control Congestion Based on Learning Automata Technique in Mobile Ad Hoc Networks

Ad hoc mobile networks have dynamic topology with no central management. Because of the high mobility of nodes, the network topology may change constantly, so creating a routing with high reliability is one of the major challenges of these networks .In the proposed framework first, by finding directions to the destination and calculating the value of the rout the combination of this value with ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:
  • CoRR

دوره cs.NI/9809094  شماره 

صفحات  -

تاریخ انتشار 1987